Browse Bar: Browse by Author | Browse by Category | Browse by Citation | Advanced Search
| Million city traveling salesman problem solution by divide and conquer clustering with adaptive resonance neural networks (2003) |
|---|
| Categories | Topics: Machine Learning, Models: ART 1, |
|---|---|
| Author(s) | Mulder S.A. | Wunsch, D.C. | |
| Abstract | The Traveling Salesman Problem (TSP) is a very hard optimization problem in the field of operations research. It has been shown to be NP-complete, and is an often-used benchmark for new optimization techniques. One of the ... |